GriSPy: A Python package for fixed-radius nearest neighbors search

نویسندگان

چکیده

We present a new regular grid search algorithm for quick fixed-radius nearest-neighbor lookup developed in Python. This module indexes set of k-dimensional points grid, with optional periodic conditions, providing fast approach nearest neighbors queries. In this first installment, we provide three types queries: bubble, shell and the nth-nearest. For these queries include different metrics interest astronomy, namely, euclidean, haversine Vincenty, last two spherical coordinates. also possibility using custom distance function. package results particularly useful large datasets where brute-force turns impractical.

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Search K Nearest Neighbors on Air

While the K-Nearest-Neighbor (KNN) problem is well studied in the traditional wired, disk-based client-server environment, it has not been tackled in a wireless broadcast environment. In this paper, the problem of organizing location dependent data and answering KNN queries on air are investigated. The linear property of wireless broadcast media and power conserving requirement of mobile device...

متن کامل

A Novel Hybrid Approach for Email Spam Detection based on Scatter Search Algorithm and K-Nearest Neighbors

Because cyberspace and Internet predominate in the life of users, in addition to business opportunities and time reductions, threats like information theft, penetration into systems, etc. are included in the field of hardware and software. Security is the top priority to prevent a cyber-attack that users should initially be detecting the type of attacks because virtual environments are not moni...

متن کامل

Accelerating High-Dimensional Nearest Neighbors for Video Search

The k-nearest neighbor algorithm (kNN) is a critical algorithm used extensively in fields such as Computer Vision, Robotics, and Machine Learning. In this work, we address the performance of FLANN, a popular kNN library, at the node-level by co-designing indexing and search algorithms with software support. We characterize, profile, and optimize FLANN for high-dimensionality (e.g., ≥ 4096) for ...

متن کامل

A Nearest Neighbors Algorithm for Strings

The algorithm is discussed in the context of one of the practical applications: aligning DNA reads to a reference genome. An implementation of the algorithm is shown to align about 106 reads per CPU minute and about 108 base-pairs per CPU minute (human DNA reads). This implementation is compared to the popular software packages Bowtie and BWA, and is shown to be over 5−10 times faster in some a...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Astronomy and Computing

سال: 2021

ISSN: ['2213-1345', '2213-1337']

DOI: https://doi.org/10.1016/j.ascom.2020.100443